The Impossibility of Extending Random Dictatorship to Weak Preferences
نویسندگان
چکیده
One of the most celebrated results in microeconomic theory is the Gibbard-Satterthwaite theorem (Gibbard, 1973; Satterthwaite, 1975), which states that every strategyproof and Pareto-optimal social choice function is a dictatorship. However, the theorem crucially relies on the assumption that outcomes are deterministic. Gibbard (1977) later considered social decision schemes, i.e., social choice functions that return lotteries over the alternatives, and showed that the class of strategyproof and ex post efficient functions extends to all random dictatorships. This class contains a unique rule that treats all agents equally: the uniform random dictatorship, henceforth random dictatorship (RD), where an agent is chosen uniformly at random and his favorite alternative is implemented as the social choice. Gibbard’s notion of strategyproofness is based on stochastic dominance and prescribes that no voter can obtain more utility by misrepresenting his preferences no matter what his utility function is (as long as it is consistent with his ordinal preferences). Another implicit assumption in Gibbard’s theorem is the anti-symmetry of individual preferences.
منابع مشابه
Fairness and efficiency in strategy-proof object allocation mechanisms
I consider the problem of allocating N indivisible objects among N agents according to their preferences when transfers are absent and an outside option may exist. I study the tradeo between fairness and e ciency in the class of strategy-proof mechanisms. The main nding is that for strategy-proof mechanisms the following e ciency and fairness criteria are mutually incompatible: (1) ex-post e ci...
متن کاملStronger Impossibility Results for Strategy-Proof Voting with i.i.d. Beliefs
The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. In [McL11], McLennan showed that a similar impossibility result holds even if we consider a weaker notion of strategy-proofness where voters believe that the other voters’ preferences are i.i.d. (independent and identically distributed): If an anonymo...
متن کاملArrow theorems in the fuzzy setting
Throughout this paper, our main idea is to analyze the Arrovian approach in a fuzzy context, paying attention to different extensions of the classical Arrow's model arising in mathematical Social Choice to aggregate preferences that the agents define on a set of alternatives. There is a wide set of extensions. Some of them give rise to an impossibility theorem as in the Arrovian classical mod...
متن کاملArrow's Impossibility Theorem Without Unanimity
Arrow’s Impossibility Theorem states that any constitution which satisfies Transitivity, Independence of Irrelevant Alternatives (IIA) and Unanimity is a dictatorship. Wilson derived properties of constitutions satisfying Transitivity and IIA for unrestricted domains where ties are allowed. In this paper we consider the case where only strict preferences are allowed. In this case we derive a ne...
متن کاملIncentives in One-Sided Matching Problems With Ordinal Preferences
One of the core problems in multiagent systems is how to efficiently allocate a set of indivisible resources to a group of self-interested agents that compete over scarce and limited alternatives. In these settings, mechanism design approaches such as matching mechanisms and auctions are often applied to guarantee fairness and efficiency while preventing agents from manipulating the outcomes. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1510.07424 شماره
صفحات -
تاریخ انتشار 2015